An Iterative Process for Optimizing Symmetric Successive Over-Relaxation
نویسندگان
چکیده
منابع مشابه
Gauss-Sidel and Successive Over Relaxation Iterative Methods for Solving System of Fuzzy Sylvester Equations
In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.
متن کاملgauss-sidel and successive over relaxation iterative methods for solving system of fuzzy sylvester equations
in this paper, we present gauss-sidel and successive over relaxation (sor) iterative methods for finding the approximate solution system of fuzzy sylvester equations (sfse), ax + xb = c, where a and b are two m*m crisp matrices, c is an m*m fuzzy matrix and x is an m*m unknown matrix. finally, the proposed iterative methods are illustrated by solving one example.
متن کاملGenerating Eecient Parallel Code for Successive Over-relaxation Generating Eecient Parallel Code for Successive Over-relaxation
Successive Over-Relaxation (SOR) is a method used extensively for solving partial diierential equations by nite diierence. Compared with the Jacobi method for the same class of problems, SOR (of which the Gauss-Seidel method is a special case) ooers faster convergence. All of the schemes of parallelizing SOR proposed require two-way communication between neighbor processors. The number of the m...
متن کاملPath Planning for Mobile Robot with Half-sweep Successive Over- Relaxation (hssor) Iterative Method
This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. T...
متن کاملGenerating Efficient Parallel Code for Successive Over-relaxation A
A complete suite of algorithms for parallelizing compilers to generate eecient SPMD code for SOR problems is presented. By applying unimodular transformation before loop tiling and parallelization, the number of messages per iteration per processor is reduced from 3 n ? 1 in the conventional parallel SOR algorithm to 2 n ?1, where n is the dimensionality of the data set. To maintain the memory-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1963
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/6.3.271